package com.leetcode.partition2;

/**
 * @author `RKC`
 * @date 2021/9/15 10:17
 */
public class LC162寻找峰值 {

    public static int findPeakElement(int[] nums) {
        int left = 0, right = nums.length - 1;
        while (left < right) {
            int mid = left + ((right - left) >> 1);
            if (nums[mid] > nums[mid + 1]) right = mid;
            else if (nums[mid] < nums[mid + 1]) left = mid + 1;
        }
        return left;
    }
}
